Row-Stochastic Matrices With a Common Left Fixed Vector*
نویسندگان
چکیده
We consider the convex polytope x(x) that consists of those n X n (row) stochastic matrices having a common nonnegative (left) fixed vector rt. We examine the l-skeleton of d(x) and show how to construct all extreme points adjacent to a given one (as vertices of the l-skeleton). Connections with transportation polytopes are discussed. Further, we give a formula for the degree of an extreme point in the l-skeleton of J,(T), find its maximum and minimum values, and determine when all degrees are equal. An explicit description of the l-skeleton is given for n = 3.
منابع مشابه
Linear maps preserving or strongly preserving majorization on matrices
For $A,Bin M_{nm},$ we say that $A$ is left matrix majorized (resp. left matrix submajorized) by $B$ and write $Aprec_{ell}B$ (resp. $Aprec_{ell s}B$), if $A=RB$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $R.$ Moreover, we define the relation $sim_{ell s} $ on $M_{nm}$ as follows: $Asim_{ell s} B$ if $Aprec_{ell s} Bprec_{ell s} A.$ This paper characterizes all linear p...
متن کاملPerfect sampling from the limit of deterministic products of stochastic matrices
We illustrate how a technique from the theory of random iterations of functions can be used within the theory of products of matrices. Using this technique we give a simple proof of a basic theorem about the asymptotic behavior of (deterministic) “backwards products” of row-stochastic matrices and present an algorithm for perfect sampling from the limiting common rowvector (interpreted as a pro...
متن کاملOn nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کامل[hal-00793906, v1] Codes and noncommutative stochastic matrices
Given a matrix over a skew field fixing the column t(1, . . . , 1), we give formulas for a row vector fixed by this matrix. The same techniques are applied to give noncommutative extensions of probabilistic properties of codes.
متن کاملAsymptotic Nearness of Stochastic and Doubly-Stochastic Matrices
We prove that the set of n×n positive (row-)stochastic matrices and the corresponding set of doubly-stochastic matrices are asymptotically close. More specifically, random matrices within each of these classes are arbitrarily close in sufficiently high dimensions. AMS 2000 subject classifications:Primary 15A51,15A52,15A60, Stochastic Matrices. Let Sn denote the set of n × n stochastic matrices ...
متن کامل